Yazar "Erten, Cesim" için listeleme
-
Biclustering expression data based on expanding localized substructures
Erten, Cesim; Sözdinler, Melih (Springer-Verlag Berlin Heidelberg, 2009)Biclustering gene expression data is the problem of extracting submatrices of genes and conditions exhibiting significant correlation across both the rows and the columns of a data matrix of expression values. We provide ... -
Colored simultaneous geometric embeddings
Brandes, Ulrik; Erten, Cesim; Fowler, J. Joseph; Frati, Fabrizio; Geyer, Markus; Gutwenger, Carsten; Hong, Seok-Hee; Kaufmann, Michael; Kobourov, Stephen G.; Liotta, Giuseppe; Mutzel, Petra; Symvonis, Antonios (Springer-Verlag Berlin, 2007)We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a universal pointset of size n for paths colored ... -
Colored simultaneous geometric embeddings and universal pointsets
Brandes, Ulrik; Erten, Cesim; Estrella-Balderrama, Alejandro; Fowler, J. Joseph; Frati, Fabrizio; Geyer, Markus; Gutwenger, Carsten; Hong, Seok-Hee; Kaufmann, Michael; Kobourov, Stephen G.; Liotta, Giuseppe; Mutzel, Petra; Symvonis, Antonios (Springer, 2011-07)Universal pointsets can be used for visualizing multiple relationships on the same set of objects or for visualizing dynamic graph processes. In simultaneous geometric embeddings, the same point in the plane is used to ... -
Crossing minimization in weighted bipartite graphs
Çakıroğlu, Olca Arda; Erten, Cesim; Karataş, Ömer; Sözdinler, Melih (Springer, 2007)Given a bipartite graph G = (L-0, L-1, E) and a fixed ordering of the nodes in L-0, the problem of finding an ordering of the nodes in L-1 that minimizes the number of crossings has received much attention in literature. ... -
Crossing minimization in weighted bipartite graphs
Çakıroğlu, Olca Arda; Erten, Cesim; Karataş, Ömer; Sözdinler, Melih (Elsevier B.V., 2009-12)Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has received much attention in literature. The ... -
Distributed iterative cluster localization in wireless sensor networks
Çakıroğlu, Olca Arda (Işık Üniversitesi, 2009-01-07)We designed a distributed algorithm for iterative cluster localization. Because this algorithm is especially designed for large scale networks, increase in the number of sensor nodes has no ine ciency e ect on sensor node ... -
Force-directed approaches to sensor localization
Efrat, Alon; Forrester, David; Iyer, Anand; Kobourov, Stephen G.; Erten, Cesim; Kılıç, Yasin Ozan (Assoc Computing Machinery, 2010-09)As the number of applications of sensor networks increases, so does the interest in sensor network localization, that is, in recovering the correct position of each node in a network of sensors from partial connectivity ... -
Force-directed approaches to sensor localization
Efrat, Alon; Forrester, David; Iyer, Anand; Kobourov, Stephen G.; Erten, Cesim (SIAM, 2006)We consider the centralized, anchor-free sensor localization problem. We consider the case where the sensor network reports range information and the case where in addition to the range, we also have angular information ... -
Fully decentralized and collaborative multilateration primitives for uniquely localizing WSNs
Çakıroğlu, Olca Arda; Erten, Cesim (Springer International Publishing AG, 2010)We provide primitives for uniquely localizing WSN nodes. The goal is to maximize the number of uniquely localized nodes assuming a fully decentralized model of computation. Each node constructs a cluster of its own and ... -
Fully decentralized, collaborative multilateration primitives for uniquely localizing WSNs
Çakıroğlu, Olca Arda; Erten, Cesim (Springer-Verlag Berlin, 2009)We provide primitives for uniquely localizing WSN nodes. The goal is to maximize the number of uniquely localized nodes assuming a fully decentralized model of computation. Each node constructs a cluster of its own and ... -
GSPIM: Graphical visualization tool for MIPS assembly programming and simulation
Borunda, Patrick; Brewer, Chris; Erten, Cesim (2007)We describe our system, GSPIM, used for visualization of low-level MIPS Assembly programming and simulation. Although many visualization tools for algorithms and high-level programs have been considered in educational ... -
A robust biclustering method based on crossing minimization in bipartite graphs
Erten, Cesim; Sözdinler, Melih (Springer-Verlag Berlin, 2009)[No abstract available] -
Robust localization framework for wireless sensor networks
Karataş, Ömer (Işık Üniversitesi, 2009-01-07)In this thesis we try to construct a robust localization framework for wireless sensor networks and sample algorithms which uses our robust localization framework. In order to handle noise in distance measurements, our ... -
A robust localization framework to handle noisy measurements in wireless sensor networks
Erten, Cesim; Karataş, Ömer (IEEE, 2009-09-14)We construct a robust localization framework to handle noisy measurements in wireless sensor networks. Traditionally many approaches employ the distance information gathered from ranging devices of the sensor nodes to ... -
Weighted bipartite crossing minimization applications on biclustering and graph unions
Sözdinler, Melih (Işık Üniversitesi, 2009-02-03)Biclustering gene expression data is the problem of extracting submatrices of genes and conditions exhibiting significant correlation across both the rows and the columns of a data matrix of expression values. We provide ...